package PriorityQueue;

import java.util.Comparator;
import java.util.PriorityQueue;

class IntCmp implements Comparator<Integer>{
    @Override
    public int compare(Integer o1, Integer o2) {
        return o2.compareTo(o1);
    }
}

public class TestPriorityQueue {
    public  int [] smallestK(int[] arr,int k){
        int [] ret =new int[k];
        if(arr==null||k==0){
            return  ret;
        }
        PriorityQueue <Integer> priorityQueue = new PriorityQueue<>();
        //k*logK
        for (int i = 0; i < k; i++) {
            priorityQueue.offer(arr[i]);
        }
        //(n-k)*logK
        for (int i=k;i<arr.length;i++){
            int peekVal = priorityQueue.peek();
            if (arr[i]< peekVal){
                priorityQueue.poll();
                priorityQueue.offer(arr[i]);
            }
        }
        for (int i = 0; i < k; i++) {
            ret[i] =priorityQueue.poll();
        }
        return ret;
    }
    public  int [] smallestK1(int[] arr,int k){
        PriorityQueue <Integer> priorityQueue = new PriorityQueue<>();
        //O(N*logN)
        for (int i = 0; i < arr.length; i++) {
            priorityQueue.offer(arr[i]);
        }
        //O(k*logN)
        int[] ret = new int[k];
        for (int i = 0; i <k ; i++) {
            ret[i] = priorityQueue.poll();
        }
        return  ret;
    }
}
